Random access to Fibonacci encoded files

نویسندگان

  • Shmuel Tomi Klein
  • Dana Shapira
چکیده

AWavelet tree is a data structure adjoined to a file that has been compressed by a variable length encoding, which allows direct access to the underlying file, resulting in the fact that the compressed file is not needed any more. We adapt, in this paper, the Wavelet tree to Fibonacci Codes, so that in addition to supporting direct access to the Fibonacci encoded file, we also increase the compression savings when compared to the original Fibonacci compressed file. The improvements are achieved by means of a new pruning technique.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Access to Fibonacci Codes

A Wavelet tree allows direct access to the underlying file, resulting in the fact that the compressed file is not needed any more. We adapt, in this paper, the Wavelet tree to Fibonacci Codes, so that in addition to supporting direct access to the Fibonacci encoded file, we also increase the compression savings when compared to the original Fibonacci compressed file.

متن کامل

Parallel Tree-Contraction and Fibonacci Numbers

We show a new property of Fibonacci numbers which is related to the analysis of a very simple and natural parallel tree contraction algorithm. We show that the size of the smallest tree which requires t contractions equals exactly the t-th Fibonacci number. This implies the sharp bound on the number of iterations of the tree contraction algorithm. We contribute also to combinatorics of trees. P...

متن کامل

The random Fibonacci recurrence and the visible points of the plane

Abstract In this letter, we show a connection between the random Fibonacci recurrence and the visible points of the plane. In particular, we show that by suitably modifying the rules of the random Fibonacci map, there is a unique correspondence between the visible points (points with relative prime coordinates) of the first quadrant and the vertices of a self-similar graph (what we call the Fib...

متن کامل

A parallel hill climbing algorithm for pushing dependent data in clients-providers-servers systems

The up-link bandwidth in satellite networks and in advanced traffic wireless information system is very limited. A server broadcasts data files provided by different independent providers and accessed by many clients in a round-robin manner. The clients who access these files may have different patterns of access. Some clients may wish to access several files in any order (AND), some wish to ac...

متن کامل

The Use of a Modified Backpropagation Neural Network for Random Access to Data Files on Secondary Storage

For many applications random access to data is critical to providing users with the level of efficiency necessary to make applications usable. It is also common to maintain data files in sequential order to allow batch processing of the data. This paper presents a method that uses a modified backpropagation neural network to locate records in a file randomly. The modifications necessary to the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 212  شماره 

صفحات  -

تاریخ انتشار 2016